Heuristic Search For Distributed Constraint Satisfaction Problems
نویسندگان
چکیده
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint satisfaction problem (CSP). Various distributed and parallel computing approaches have been used to solve these problems. Mainly, these approaches can be classiied as variable-based, domain-based, and function-based distributed problem solving strategies. In this paper, some heuristic search methods are used to enforce these distributed and parallel problem solving strategies.
منابع مشابه
Distributed Guided Local Search for Solving Binary DisCSPs
We introduce the Distributed Guided Local Search (DistGLS) algorithm for solving Distributed Constraint Satisfaction Problems. Our algorithm is based on the centralised Guided Local Search algorithm, which is extended with additional heuristics in order to enhance its efficiency in distributed scenarios. We discuss the strategies we use for dealing with local optima in the search for solutions ...
متن کاملApplying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] for solving large propositional satisfiability (SAT) problems and binary Constraint Satisfaction Problems (CSPs) respectively. Newer SAT techniques, such as the Discrete Langrangian Method (DLM) [10], have significantly ...
متن کاملA Local Search Approach to Modelling and Solving Interval Algebra Problems
Local search techniques have attracted considerable interest in the artificial intelligence community since the development of GSAT and the minconflicts heuristic for solving propositional satisfiability (SAT) problems and binary constraint satisfaction problems (CSPs) respectively. Newer techniques, such as the discrete Langrangian method (DLM), have significantly ∗The authors gratefully ackno...
متن کاملA Value Ordering Heuristic for Local Search in Distributed Resource Allocation
In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achieve desirable properties (increased effectiveness, or better allocations). The specific distributed resource allocation problem that we consider is sensor allocation in sensor networks, and the algorithmic skeleton that we use ...
متن کاملDynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, multiple local variables may be required within each autonomous agent. A number of heuristics have been developed for solving such multiple local variable problems. However, these approaches do not always guarantee agent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993